Random moment problems under constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability optimization problems with multiple constraints under fuzziness

In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...

متن کامل

Large deviations for random matricial moment problems

We consider the moment space Mn corresponding to p × p complex matrix measures defined on K (K = [0, 1] or K = T). We endow this set with the uniform law. We are mainly interested in large deviations principles (LDP) when n→∞. First we fix an integer k and study the vector of the first k components of a random element ofMn . We obtain a LDP in the set of k-arrays of p× p matrices. Then we lift ...

متن کامل

Growing random networks under constraints

In recent years measurements on a wide variety of networks such as the world wide web [13,2], the internet backbone [4], social networks [3,24,26] and metabolic networks [14,25] have shown that they differ significantly from the classic Erdos-Renyi model of random graphs [17]. While the traditional Erdos-Renyi model has a Poisson link distribution, with most nodes having a characteristic number...

متن کامل

Extremal problems under dimension constraints

The aim of this paper is to systematically present an area of extremal problems under dimension constraints. We state conjectures and solutions for many of these problems. Proofs will be given in several papers, each devoted to a specific problem.

متن کامل

Object Allocation Problems Under Constraints

The Object Allocation Problem (OAP) is a well studied problem in which a set X of n objects is allocated to a set N of n agents. This paper deals with a generalization called Constrained Object Allocation Problem (COAP) where the set of objects allocated to the agents must satisfy a given feasibility constraint. The input is a set X of at least n elements and a collection S of subsets of X , ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 2020

ISSN: 0091-1798

DOI: 10.1214/19-aop1370